Automatic Handshake Expansion and Reshuuing Using Concurrency Reduction

We present an automatic technique for handshake expansion and reshuuing in asynchronous control circuit design. A designer can deene the behavior of a control circuit using a CSP-like or STG-like notation. This deenition may be partial, i.e. involve only some of the actual events. The method solves handshake expansion by inserting reset events with maximal concurrency and then automatically explores reshuuing of events under interface and concurrency constraints using a single basic operation { concurrency reduction. The algorithm trades oo the number of required state signals and logic complexity. Experimental results show that this approach provides more exibility in the design process than completely speciied CSP or STG. It signiicantly increases the solution space for logic synthesis compared to existing CSP-based or STG-based synthesis tools.